Preservation of admissible rules when combining logics

摘要

Admissible rules are shown to be conservatively preserved by themeet-combination of a wide class of logics. A basis is obtained for theresulting logic from bases given for the component logics. Structuralcompleteness and decidability of the set of admissible rules are also shown tobe preserved, the latter with no penalty on the time complexity. Examples areprovided for the meet-combination of intermediate and modal logics.